Restricted polynomial expansions and approximation
نویسندگان
چکیده
منابع مشابه
Polynomial Expansions
The expansion of arbitrary power series in various classes of polynomial sets is considered. Some applications are also given. Notations. We will use the following contracted notation for the generalized hypergeometric function •i> •flB P q\bl,...,bQ pFAb, ^ M* z_k where p. « r(o4 k) («iOfc-n fy)*. (*v*s rw* and (°)* / = ! / = ! r(o)
متن کاملA Quasi-Polynomial Approximation for the Restricted Assignment Problem
Scheduling jobs on unrelated machines and minimizing the makespan is a classical problem in combinatorial optimization. In this problem a job j has a processing time pij for every machine i. The best polynomial algorithm known goes back to Lenstra et al. and has an approximation ratio of 2. In this paper we study the Restricted Assignment problem, which is the special case where pij ∈ {pj ,∞}. ...
متن کاملpolynomial chaos expansions KEVIN
Submitted for the MAR13 Meeting of The American Physical Society Simulation of stochastic quantum systems using polynomial chaos expansions KEVIN YOUNG, MATTHEW GRACE, Sandia National Laboratories — We present an approach to the simulation of quantum systems driven by classical stochastic processes that is based on the polynomial chaos expansion, a well-known technique in the field of uncertain...
متن کاملA Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions
We propose an algorithm for recovering sparse orthogonal polynomial expansions via collocation. A standard sampling approach for recovering sparse polynomials uses Monte Carlo sampling, from the density of orthogonality, which results in poor function recovery when the polynomial degree is high. Our proposed approach aims to mitigate this limitation by sampling with respect to the weighted equi...
متن کاملParry Expansions of Polynomial Sequences
We prove that the sum-of-digits function with respect to certain digital expansions (which are related to linear recurrences) and similarly defined functions evaluated on polynomial sequences of positive integers or primes satisfy a central limit theorem. These digital expansions are special cases of numeration systems associated to primitive substitutions on finite alphabets, the digits of whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1992
ISSN: 0377-0427
DOI: 10.1016/0377-0427(92)90047-2